Entropy Bounds for Discrete Random Variables via Maximal Coupling

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Inequalities for Associated Random Variables

In a celebrated work by Shao [13] several inequalities for negatively associated random variables were proved. In this paper we obtain some maximal inequalities for associated random variables. Also we establish a maximal inequality for demimartingales which generalizes and improves the result of Christofides [4].

متن کامل

Entropy and thinning of discrete random variables

We describe five types of results concerning information and concentration of discrete random variables, and relationships between them. These results are motivated by their counterparts in the continuous case. The results we consider are information theoretic approaches to Poisson approximation, the maximum entropy property of the Poisson distribution, discrete concentration (Poincaré and loga...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Entropy Bounds for Discrete Random Varibles via Coupling

This paper derives new entropy bounds for discrete random variables via maximal coupling. It provides bounds on the difference between the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. These bounds address cases of finite or countable infinite alphabets. Particular cases of these bounds reproduce some kno...

متن کامل

maximal inequalities for associated random variables

in a celebrated work by shao [13] several inequalities for negatively associated random variables were proved. in this paper we obtain some maximal inequalities for associated random variables. also we establish a maximal inequality for demimartingales which generalizes and improves the result of christofides [4].

متن کامل

New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in efficient capacity-achieving codes for a wide range of channels. However, this technique is not limited to problems in communications. It can be ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2013

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2013.2274515